Efficient static analysis with path pruning using coverage data
نویسندگان
چکیده
منابع مشابه
Efficient Incremental Static Analysis Using Path Abstraction
ion Rashmi Mudduluru and Murali Krishna Ramanathan {mudduluru.rashmi,muralikrishna}@csa.iisc.ernet.in Indian Institute of Science, Bangalore, India Abstract. Incremental static analysis involves analyzing changes to a version of a source code along with analyzing code regions that are semantically affected by the changes. Existing analysis tools that attempt Incremental static analysis involves...
متن کاملEfficient location by using data envelopment analysis
So far, many types of location models have been developed to find optimal spatial patterns according to different spatial metrics such as cost, coverage and availability. The initial focus of these models is on the location availability of service providers and demand estimates, and some of these models are within the framework of multi-objective programming models. After the advent of scienc...
متن کاملMinimum K-Path Vertex using Pruning Algorithm
For a directed graph G with vertex set V we call a subset C ₵ V a k-(All-) Path Cover if C contains a node from any path consisting of k nodes. This paper considers the problem of constructing small k-Path Covers in the context of road networks with millions of nodes and edges. In many application scenarios the set C and its induced overlay graph constitute a very compact synopsis of G which is...
متن کاملConnection pruning with static and adaptive pruning schedules
Neural network pruning methods on the level of individual network parameters (e.g. connection weights) can improve generalization, as is shown in this empirical study. However, an open problem in the pruning methods known today (e.g. OBD, OBS, autoprune, epsiprune) is the selection of the number of parameters to be removed in each pruning step (pruning strength). This work presents a pruning me...
متن کاملStatic Analysis by Path Focusing
Program verification aims at statically discovering properties on programs, such as the values that can take the different variables during execution. Abstract Interpretation is a technique that computes an over-approximation of the set of these values, since it is impossible to compute the real set in general. This report takes place in the many attempts to improve the precision of static Anal...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGSOFT Software Engineering Notes
سال: 2005
ISSN: 0163-5948
DOI: 10.1145/1082983.1083257